app2(app2(app2(uncurry, f), x), y) -> app2(app2(f, x), y)
↳ QTRS
↳ DependencyPairsProof
app2(app2(app2(uncurry, f), x), y) -> app2(app2(f, x), y)
APP2(app2(app2(uncurry, f), x), y) -> APP2(app2(f, x), y)
APP2(app2(app2(uncurry, f), x), y) -> APP2(f, x)
app2(app2(app2(uncurry, f), x), y) -> app2(app2(f, x), y)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
APP2(app2(app2(uncurry, f), x), y) -> APP2(app2(f, x), y)
APP2(app2(app2(uncurry, f), x), y) -> APP2(f, x)
app2(app2(app2(uncurry, f), x), y) -> app2(app2(f, x), y)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
APP2(app2(app2(uncurry, f), x), y) -> APP2(app2(f, x), y)
APP2(app2(app2(uncurry, f), x), y) -> APP2(f, x)
POL( uncurry ) = 2
POL( APP2(x1, x2) ) = max{0, 2x1 - 1}
POL( app2(x1, x2) ) = max{0, 2x1 + x2 - 2}
app2(app2(app2(uncurry, f), x), y) -> app2(app2(f, x), y)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
app2(app2(app2(uncurry, f), x), y) -> app2(app2(f, x), y)